Sorting, swapping, and organizing objects on transfer ball grids

ABSTRACT

An approach is provided to sort objects on a surface of vertically-adjustable low friction transfer modules that are controlled by processors. A request to sort the plurality of objects in a horizontal direction is received with each of the objects is assigned a sort position. Sets of the vertically-adjustable low friction transfer modules are selected. The vertically-adjustable low friction transfer modules are arranged in a grid formation on the surface, with each of the sets of selected transfer modules being underneath a different object. The sets of selected transfer modules are vertically adjusted causing each of the objects to move independently from the other objects while avoiding the other objects in two or more dimensions formed on the surface. The result of the movement is that each of the objects is moved to a position respective of the other objects according to each object&#39;s respective sort position.

BACKGROUND OF THE INVENTION

The efficient movement, storage and retrieval of objects is a nearlyuniversal challenge, but is particularly well illustrated in the contextof a warehouse where crates or pallets are received, stored for acertain time, then retrieved and dispatched. In modern warehouses, thewarehouse inventory and storage plan is typically computerized in awarehouse management system (WMS), but the actual storage and retrievalof the stored objects is a physical, often manual, process. There are anumber of current approaches to moving objects within a warehouseenvironment. At the most basic, WMS can provide the location of theobject to be stored or retrieved to a human, and the human can drive aforklift to the specified location. This approach has several drawbacks.First, a relatively large number of individuals are required to performthe relatively monotonous task of repeatedly storing and retrievingobjects. This can lead to both significant personnel costs, as well asan increased rate of human error due to fatigue and boredom.Additionally, the number of forklifts on the warehouse floor at a timeis limited, since it is difficult for the operators to efficiently findalternate paths in the case that the main path is congested.Furthermore, the warehouse shelving and objects are traditionallylabeled for reference by the human operators. Labeling is somewhattroublesome and is generally unnecessary in an automated system. Moreadvanced systems utilizes robotic forklifts to execute the storage andretrieval of the managed objects. Robotic forklifts are integrated withthe WMS to automatically take objects from an incoming dock to a storagelocation, or from the storage location to an outgoing dock. The use ofrobotic forklifts eliminates the issues of human error and fatigue, aswell as limiting the personnel costs to the individuals required tomaintain the forklifts. Additionally, since the robotic forklifts are inconstant communication with a dispatching system, they are able todynamically find paths that are not obstructed by other roboticforklifts, allowing an increase in density over human-operatedforklifts. However, the robotic forklifts are complex, and requiresignificant maintenance and specialized parts to repair. Additionally,the forklifts require a certain amount of space to maneuver, so thedensity of objects being moved is limited. Conveyer belts is anothertraditional approach used to transport objects, particularly infactories and shipping facilities. Conveyer belts provide automaticmovement of objects from one point to another along a fixed path.However, being a fixed system, conveyer belts generally lack theflexibility found in other systems, because the layout of conveyer beltsrequires significant time and effort to change, as well as requiringpotentially lengthy work stoppages.

SUMMARY

An approach is provided to sort objects on a surface ofvertically-adjustable low friction transfer modules that are controlledby processors. A request to sort the plurality of objects in ahorizontal direction is received wherein each of the objects is assigneda sort position. Sets of the vertically-adjustable low friction transfermodules are selected. The vertically-adjustable low friction transfermodules are arranged in a grid formation on the surface, with each ofthe sets of selected transfer modules being underneath a differentobject. The sets of selected transfer modules are vertically adjustedcausing each of the objects to move independently from the other objectswhile avoiding the other objects in two or more dimensions formed on thesurface. The result of the movement is that each of the objects is movedto a position respective of the other objects according to each object'srespective sort position. In a second variation a request to sort aplurality of objects in both vertical and horizontal directions arereceived with selected vertically-adjustable transfer modules moving inconcert to accommodate the sort the sort request. Again the result ofthe movement is that each of the objects is moved to a positionrespective of the other objects according to each object's respectivesort position.

The foregoing is a summary and thus contains, by necessity,simplifications, generalizations, and omissions of detail; consequently,those skilled in the art will appreciate that the summary isillustrative only and is not intended to be in any way limiting. Otheraspects, inventive features, and advantages of the present invention, asdefined solely by the claims, will become apparent in the non-limitingdetailed description set forth below.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention may be better understood, and its numerousobjects, features, and advantages made apparent to those skilled in theart by referencing the accompanying drawings, wherein:

FIG. 1 is a block diagram of a data processing system in which themethods described herein can be implemented;

FIG. 2 provides an extension of the information handling systemenvironment shown in FIG. 1 to illustrate that the methods describedherein can be performed on a wide variety of information handlingsystems which operate in a networked environment;

FIG. 3 is a diagram showing a transfer ball grid capable of moving anobject in many different directions;

FIG. 4A is a diagram showing two transfer ball housings that wouldprovide two of the transfer balls in the transfer ball grid shown inFIG. 3;

FIG. 4B is a diagram showing activation of three transfer ball housingswithin the transfer ball grid shown in FIG. 3 activated to move theobject in a particular direction;

FIG. 5 is a flowchart showing steps performed to use the transfer ballgrid to move an object;

FIG. 6 is a flowchart showing steps performed to initiate movement of anobject using the transfer ball grid;

FIG. 7 is a flowchart showing steps performed while moving an objectusing the transfer ball grid;

FIG. 8 is a flowchart showing steps performed during a controlled stopof the object being moved using the transfer ball grid;

FIG. 9 is a flowchart showing processing performed at each transfer ballunit to process commands received at the unit;

FIG. 10 is a flowchart showing processing used to perform aone-dimensional sort on a group of objects using the transfer ball grid;

FIG. 11 is a first diagram showing the group of objects being sorted ina one-dimensional sort in an unconstrained grid environment;

FIG. 12 is a second diagram showing the group of objects being sorted ina one-dimensional sort in an unconstrained grid environment;

FIG. 13 is a flowchart showing processing used to perform aone-dimensional sort on a group of objects using the transfer ball gridin a constrained grid environment;

FIG. 14 is a flowchart showing processing used to swap two objects usingthe transfer ball grid;

FIG. 15 is a diagram showing the group of objects being sorted in aone-dimensional sort in a constrained grid environment;

FIG. 16 is a flowchart showing processing used to perform atwo-dimensional sort on a group of objects using the transfer ball grid;

FIG. 17 is a flowchart showing processing used to spread objects apartin order to perform the two-dimensional sort;

FIG. 18 is a flowchart showing processing used to move objects tocorrect rows in the two-dimensional sort;

FIG. 19 is a flowchart showing processing used to group objects in thetwo-dimensional sort;

FIG. 20 is a flowchart showing processing used to pack rows of objectsin the two-dimensional sort;

FIG. 21 is a first diagram showing the group of objects being spread outand then moved to correct rows; and

FIG. 22 is a second diagram showing the group of objects being groupedand packed to complete the two-dimensional sort.

DETAILED DESCRIPTION

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the disclosure.As used herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of oneor more other features, integers, steps, operations, elements,components, and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present disclosure has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the disclosure in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the disclosure. Theembodiment was chosen and described in order to best explain theprinciples of the disclosure and the practical application, and toenable others of ordinary skill in the art to understand the disclosurefor various embodiments with various modifications as are suited to theparticular use contemplated.

As will be appreciated by one skilled in the art, aspects of the presentdisclosure may be embodied as a system, method or computer programproduct. Accordingly, aspects of the present disclosure may take theform of an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present disclosure may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of thepresent disclosure may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java, Smalltalk, C++ or the like and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present disclosure are described below with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of thedisclosure. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

The following detailed description will generally follow the summary ofthe disclosure, as set forth above, further explaining and expanding thedefinitions of the various aspects and embodiments of the disclosure asnecessary.

The following detailed description will generally follow the summary ofthe invention, as set forth above, further explaining and expanding thedefinitions of the various aspects and embodiments of the invention asnecessary. To this end, this detailed description first sets forth acomputing environment in FIG. 1 that is suitable to implement thesoftware and/or hardware techniques associated with the invention. Anetworked environment is illustrated in FIG. 2 as an extension of thebasic computing environment, to emphasize that modern computingtechniques can be performed across multiple discrete devices.

FIG. 1 illustrates information handling system 100, which is asimplified example of a computer system capable of performing thecomputing operations described herein. Information handling system 100includes one or more processors 110 coupled to processor interface bus112. Processor interface bus 112 connects processors 110 to Northbridge115, which is also known as the Memory Controller Hub (MCH). Northbridge115 connects to system memory 120 and provides a means for processor(s)110 to access the system memory. Graphics controller 125 also connectsto Northbridge 115. In one embodiment, PCI Express bus 118 connectsNorthbridge 115 to graphics controller 125. Graphics controller 125connects to display device 130, such as a computer monitor.

Northbridge 115 and Southbridge 135 connect to each other using bus 119.In one embodiment, the bus is a Direct Media Interface (DMI) bus thattransfers data at high speeds in each direction between Northbridge 115and Southbridge 135. In another embodiment, a Peripheral ComponentInterconnect (PCI) bus connects the Northbridge and the Southbridge.Southbridge 135, also known as the I/O Controller Hub (ICH) is a chipthat generally implements capabilities that operate at slower speedsthan the capabilities provided by the Northbridge. Southbridge 135typically provides various busses used to connect various components.These busses include, for example, PCI and PCI Express busses, an ISAbus, a System Management Bus (SMBus or SMB), and/or a Low Pin Count(LPC) bus. The LPC bus often connects low-bandwidth devices, such asboot ROM 196 and “legacy” I/O devices (using a “super I/O” chip). The“legacy” I/O devices (198) can include, for example, serial and parallelports, keyboard, mouse, and/or a floppy disk controller. The LPC busalso connects Southbridge 135 to Trusted Platform Module (TPM) 195.Other components often included in Southbridge 135 include a DirectMemory Access (DMA) controller, a Programmable Interrupt Controller(PIC), and a storage device controller, which connects Southbridge 135to nonvolatile storage device 185, such as a hard disk drive, using bus184.

ExpressCard 155 is a slot that connects hot-pluggable devices to theinformation handling system. ExpressCard 155 supports both PCI Expressand USB connectivity as it connects to Southbridge 135 using both theUniversal Serial Bus (USB) the PCI Express bus. Southbridge 135 includesUSB Controller 140 that provides USB connectivity to devices thatconnect to the USB. These devices include webcam (camera) 150, infrared(IR) receiver 148, keyboard and trackpad 144, and Bluetooth device 146,which provides for wireless personal area networks (PANs). USBController 140 also provides USB connectivity to other miscellaneous USBconnected devices 142, such as a mouse, removable nonvolatile storagedevice 145, modems, network cards, ISDN connectors, fax, printers, USBhubs, and many other types of USB connected devices. While removablenonvolatile storage device 145 is shown as a USB-connected device,removable nonvolatile storage device 145 could be connected using adifferent interface, such as a Firewire interface, etcetera.

Wireless Local Area Network (LAN) device 175 connects to Southbridge 135via the PCI or PCI Express bus 172. LAN device 175 typically implementsone of the IEEE 0.802.11 standards of over-the-air modulation techniquesthat all use the same protocol to wireless communicate betweeninformation handling system 100 and another computer system or device.Optical storage device 190 connects to Southbridge 135 using Serial ATA(SATA) bus 188. Serial ATA adapters and devices communicate over ahigh-speed serial link. The Serial ATA bus also connects Southbridge 135to other forms of storage devices, such as hard disk drives. Audiocircuitry 160, such as a sound card, connects to Southbridge 135 via bus158. Audio circuitry 160 also provides functionality such as audioline-in and optical digital audio in port 162, optical digital outputand headphone jack 164, internal speakers 166, and internal microphone168. Ethernet controller 170 connects to Southbridge 135 using a bus,such as the PCI or PCI Express bus. Ethernet controller 170 connectsinformation handling system 100 to a computer network, such as a LocalArea Network (LAN), the Internet, and other public and private computernetworks.

While FIG. 1 shows one information handling system, an informationhandling system may take many forms. For example, an informationhandling system may take the form of a desktop, server, portable,laptop, notebook, or other form factor computer or data processingsystem. In addition, an information handling system may take other formfactors such as a personal digital assistant (PDA), a gaming device, ATMmachine, a portable telephone device, a communication device or otherdevices that include a processor and memory.

The Trusted Platform Module (TPM 195) shown in FIG. 1 and describedherein to provide security functions is but one example of a hardwaresecurity module (HSM). Therefore, the TPM described and claimed hereinincludes any type of HSM including, but not limited to, hardwaresecurity devices that conform to the Trusted Computing Groups (TCG)standard, and entitled “Trusted Platform Module (TPM) SpecificationVersion 1.2.” The TPM is a hardware security subsystem that may beincorporated into any number of information handling systems, such asthose outlined in FIG. 2.

FIG. 2 provides an extension of the information handling systemenvironment shown in FIG. 1 to illustrate that the methods describedherein can be performed on a wide variety of information handlingsystems that operate in a networked environment. Types of informationhandling systems range from small handheld devices, such as handheldcomputer/mobile telephone 210 to large mainframe systems, such asmainframe computer 270. Examples of handheld computer 210 includepersonal digital assistants (PDAs), personal entertainment devices, suchas MP3 players, portable televisions, and compact disc players. Otherexamples of information handling systems include pen, or tablet,computer 220, laptop, or notebook, computer 230, workstation 240,personal computer system 250, and server 260. Other types of informationhandling systems that are not individually shown in FIG. 2 arerepresented by information handling system 280. As shown, the variousinformation handling systems can be networked together using computernetwork 200. Types of computer network that can be used to interconnectthe various information handling systems include Local Area Networks(LANs), Wireless Local Area Networks (WLANs), the Internet, the PublicSwitched Telephone Network (PSTN), other wireless networks, and anyother network topology that can be used to interconnect the informationhandling systems. Many of the information handling systems includenonvolatile data stores, such as hard drives and/or nonvolatile memory.Some of the information handling systems shown in FIG. 2 depictsseparate nonvolatile data stores (server 260 utilizes nonvolatile datastore 265, mainframe computer 270 utilizes nonvolatile data store 275,and information handling system 280 utilizes nonvolatile data store285). The nonvolatile data store can be a component that is external tothe various information handling systems or can be internal to one ofthe information handling systems. In addition, removable nonvolatilestorage device 145 can be shared among two or more information handlingsystems using various techniques, such as connecting the removablenonvolatile storage device 145 to a USB port or other connector of theinformation handling systems.

FIGS. 3-9 depict an approach that can be executed on an informationhandling system and computer network as shown in FIGS. 1-2. Objects needto be moved across surfaces in a wide variety of environments. Theapproach described herein automates this process and makes movement ofobjects, such as large pallets, containers, and crates, safer and moreefficient. This approach is scalable to work with small area movementsto large area movements. It is also scalable with respect to the size ofthe objects that are being moved. In this manner, very small objects,such as electronic components can be moved by this approach, as well aslarge objects like shipping containers. This approach can beincorporated into an automatic or automated warehouse system. However,this approach is not limited to such applications as it could be used ina variety of environments such as shipyards, inside of moving trucks,and other environments where objects need to be moved across a surface.

A surface is provided which is covered with a large number ofvertically-adjustable low friction transfer modules. Thevertically-adjustable low friction transfer modules can be a transferball unit with a freely spinning ball on top of the unit capable ofsupporting weight, a set of protruding bearings at the top of themodule, a set of rounded buttons that can spin, or any low frictionsurface upon which an object may slide when slanted at an incline. Eachvertically-adjustable low friction transfer module is in a housing thatis capable of being raised or lowered by computer control (e.g.,controlled by an information handling system as shown in FIG. 1). Thetransfer modules are sized and arranged in a grid so that an objectbeing moved will rest on a relatively large number of transfer modules.In order to move an object, the transfer modules under the object areraised a varying amount to create an inclined plane with the downwardslope in the desired horizontal direction of travel across the surface.The slope is increased gradually until the object starts to roll “downhill” in the desired horizontal direction. As the object rolls over newtransfer modules, they are raised to maintain the inclined plane, and atthe same time the transfer modules no longer supporting the object arereturned to the default lowered position (e.g., level with or below thesurface, etc.). In this manner, an object can be moved smoothly acrossthe surface as if the entire surface was inclined. This approach alsolimits the potential damage in case of a system failure. Long distancemovement can be controlled by a synchronized coordination of raising andlowering of transfer modules to provide controlled movement stops andchanges in direction.

FIG. 3 is a diagram showing a transfer ball grid capable of moving anobject in many different directions. FIG. 3 provides a top view ofsurface 300, such as might be found on in a warehouse or otherenvironment where objects are moved across the surface. Transfer ballgrid 310 is a grid of many separate vertically-adjustable low frictiontransfer modules (325) arranged in a grid pattern. Any grid pattern,such as a rectangular pattern, an offset pattern, etc. can be used toimplement the grid with the particular pattern and spacing of thevertically-adjustable low friction transfer modules, in one embodiment,based on the types of objects being moved across the surface (e.g.,small objects, large objects, etc.). The transfer modules are raised andlowered as described in further detail herein in order to move object320 horizontally across surface 300. Sensors 330 detect the position ofobject 320 to identify the particular transfer modules that should beraised and lowered to move the object. In one embodiment, object 320 canbe moved in virtually any horizontal direction along surface 300 basedon the movement (raising and lowering) of the transfer modulesunderneath and proximate to object 320. The arrows emanating at object320 depict possible horizontal movement paths of object 320 alongsurface 300.

FIG. 4A is a diagram showing two transfer ball housings that wouldprovide two of the transfer balls in the transfer ball grid shown inFIG. 3. Transfer module 325 is a vertically-adjustable low frictionmodule that, as shown is capable of moving up and down within a housing.In one embodiment, vertical height adjustment 420 is performed by alinear actuator. In another embodiment, the vertical height adjustmentis performed by servomotors and linkages. In another embodiment,adjusting the heights of the vertically-adjustable low friction transfermodules is performed using a hydraulic lift assembly included in eachtransfer module. Sensors 330 are included with the transfer modules tosense an object on top of the transfer modules. In one embodiment,sensors 330 are light sensitive capable of sensing light shining in theaperture of the housing. When the light is blocked by an object, thesensor is triggered. In one embodiment, the inactive position of thevertically-adjustable low friction transfer modules is below the surfaceso that vehicles and other forms of transport can also take place overthe surface without the low friction qualities of the transfer modulesimpeding such transport while the transfer modules are inactive.

FIG. 4B is a diagram showing activation of three transfer ball housingswithin the transfer ball grid shown in FIG. 3 activated to move theobject in a particular direction. The three vertically-adjustable lowfriction transfer modules are labeled 451, 452, and 453 and are used todepict the inclined plane produced by varying the height of the varioustransfer modules. Height adjustors 420 corresponding to the varioustransfer modules are raised in order for the back side of object 320 tobe raised to a height greater than the front side of object 320, withthe desired horizontal direction (movement) of the object being towardsthe front side of the object. While only three transfer modules areshown, many sets of transfer modules would actually be engaged andraised to different heights to create the inclined plane.

Transfer modules 451, 452, and 453 would be raised to different heightscreating an inclined plane as shown. As object 320 moves in thehorizontal direction shown, additional transfer modules in front of theobject would be raised to receive the object and transfer modules 451,452, and 453 would be raised to different heights to maintain theinclined plane at a position further along the horizontal path of theobject. When a transfer module is no longer underneath the object (e.g.,when object passes completely past transfer module 451, etc.), thetransfer module is lowered to its initial, disengaged position aspreviously shown in FIG. 4A. In one embodiment, low friction aspect 400at the top surface of the vertically-adjustable low friction transfermodules is provided by a transfer ball unit that rolls in any direction.In another embodiment, a set of protruding bearings (e.g., ballbearings, etc.) provides low friction aspect 400 at the top surface ofthe transfer modules. In another embodiment, a set of rounded buttonsprovides low friction aspect 400 at the top surface of the transfermodules. As described in further detail herein, front side transfermodules can be raised in order to provide a controlled stop to thehorizontal movement of object 320.

FIG. 5 is a flowchart showing steps performed to use the transfer ballgrid to move an object. Processing commences at 500 whereupon, at step510, an operator of the process (e.g., another process, a humanoperator, etc.) selects an object to be moved (e.g., an object on asurface of a warehouse, etc.). At step 520, the operator selects ahorizontal direction in which the object is to be moved. In oneembodiment, the horizontal direction is any direction (e.g., north,south, east, west, northeast, northwest, southeast, southwest, anycompass degree setting, etc.). In addition, at step 520 the destinationof the movement is selected (e.g., one hundred feet south, etc.). Aseries of movement directions and destinations can be provided totraverse a surface (e.g., to avoid other objects, etc.).

At step 525, the process selects the vertically-adjustable low frictiontransfer modules that are underneath the object. At predefined process530, a signal is sent to the selected transfer modules to initiatemovement of the object (see FIG. 9 and corresponding text for “initiate”processing details). The initiation of movement will raise the objectonto the transfer modules underneath the object by raising the selectedtransfer modules and thereby raising the object. Movement of the objectis accomplished by the process identifying one or more back-side sets oftransfer modules from the transfer modules underneath the object as wellas one or more front-side sets of transfer modules from the transfermodules underneath the object. The back-side sets of transfer modulesare toward the back side of the object that is opposite (away from) thehorizontal direction selected by the operator, and the front-side setsof transfer modules are toward the front of the object that is towardsthe horizontal direction. As used herein, the “front side” of the objectrefers to the side of the object facing the direction in which theobject is being moved and does not refer to the actual face of theobject, and likewise, the “back side” of the object refers to the sideof the object facing away from the direction in which the object isbeing moved and does not refer to the actual rear of the object.

At step 540, processing selects the transfer modules that are locatedproximate (e.g., adjacent to, etc.) the object in the direction of theselected movement path (e.g., the next transfer modules over which theobject will travel in the selected direction). At predefined process550, a signal is sent to the selected transfer modules proximate to theobject instructing the selected transfer modules to prepare to receivethe object (e.g., by raising from a disengaged position to a lowvertical position that allows the object to move over the selectedtransfer modules, etc.). See FIG. 9 and corresponding text forprocessing details regarding “prepare to receive” processing of thetransfer modules.

At predefined process 560, movement is initialized in the directionselected by the operator (see FIG. 6 and corresponding text forprocessing details). In one embodiment, the transfer modules under theback side of the object are raised at the same time that transfermodules under the front side of the object are lowered in order togently create an inclined plane upon which the object will movehorizontally across the surface. In another embodiment, the identifiedback-side sets of transfer modules are raised to a first set of one ormore vertical heights, and the identified front-side sets of transfermodules are raised (from the disengaged position) to a second set of oneor more vertical heights, with the average of the first set of verticalheights being higher than the average of the second set of verticalheights. When viewed from the side, the object will appear to be on anincline plane and will move in the selected horizontal direction due togravity and the low friction provided by the top surface of the transfermodules.

After movement has been initialized, movement in the selected horizontaldirection is continued using the processing shown in predefined process570 (see FIG. 7 and corresponding text for processing details). Whilethe object is moving, processing repeatedly checks as to whether theobject is at a position just before the selected designation (decision575). Decision 575 repeatedly loops back to predefined process 570 untilthe object is at the destination where the controlled stop shouldcommence. When the object reaches the destination where the controlledstop should commence, which may be before the actual destination chosenby the operator based upon the distance needed to perform the controlledstop, decision 575 branches to the “yes” branch to stop the object. Atpredefined process 570, the object comes to a controlled stop (see FIG.8 and corresponding text for processing details).

A decision is made as to whether the operator is requesting to changethe direction and/or the destination of the object (decision 580). Ifthe operator is requesting to change the direction and/or thedestination of the object, then decision 580 branches to the “yes”branch which loops back to receive the next movement direction anddestination. This looping continues until the object is at the finaldestination, at which point decision 580 branches to the “no” branch andprocessing ends at 595.

FIG. 6 is a flowchart showing steps performed to initiate movement of anobject using the transfer ball grid. Movement initialization processingcommences at 600 whereupon, at step 610, an increment height isretrieved for a desired, or predefined, movement speed. Greaterincrement heights create a steeper inclined plane and faster horizontalmovement speed, while lesser incremental heights create a shallowerinclined plane and slower horizontal movement speed. At step 615, alower height value is initialized to be an initial height value and, atstep 620, the raise height value is also initialized to be the initialheight value. In one embodiment, the initial height value is a mid-pointvalue between the lowest height of the inclined plane that is beingcreated and the highest height of the inclined plane that is beingcreated.

At step 625, the number of sets (e.g., lines, etc.) of transfer modulesunderneath the unit are identified from front to back with the frontbeing the direction of the horizontal movement. At step 630, themidpoint set is determined by dividing the total number of sets oftransfer modules by two. Two parallel processes commence (640 and 670)with process 640 operating to lower the front side transfer modules fromthe initial height and process 670 operating to raise the back sideunits from the initial height.

Process 640 lowers the front side transfer modules from the midpoint tothe front of the object. At step 645, the first set (e.g., line) oftransfer modules are selected nearest the midpoint. At step 650, alowered height setting is calculated for the selected set of front sidetransfer modules by subtracting the current lower height by theincremental height. At predefined process 655, processing signals eachof the selected transfer modules to lower their height to the calculatedlower height value (see FIG. 9 and corresponding text for processingdetails used to set a transfer module to a numeric height value). Adecision is made as to whether there are more sets of front sidetransfer modules to lower (decision 660). If there are more front sidetransfer modules to lower (e.g., the front-most set of transfer moduleshas not been reached), then decision 660 branches to the “yes” branchwhich loops back to select the next set (e.g., line) of front sidetransfer modules and these selected transfer modules are set to an evenlower height as the lower height value is further decreased by theincremental height value. This looping and repeated lowering of furthersets of front side transfer modules continues until there are no morefront side transfer modules to process, at which point decision 660branches to the “no” branch exiting process 640.

Process 670 raises the back side transfer modules from the midpoint tothe back of the object. As previously described, process 670 takes placeconcurrently (in parallel) with process 640 which is used to lower frontside transfer modules. At step 675, the first set (e.g., line) oftransfer modules are selected nearest the midpoint. At step 680, araised height setting is calculated for the selected set of back sidetransfer modules by adding the current raised height by the incrementalheight. At predefined process 685, processing signals each of theselected transfer modules to raise their height to the calculated raisedheight value (see FIG. 9 and corresponding text for processing detailsused to set a transfer module to a numeric height value). A decision ismade as to whether there are more sets of back side transfer modules toraise (decision 690). If there are more back side transfer modules toraise (e.g., the back-most set of transfer modules has not beenreached), then decision 690 branches to the “yes” branch which loopsback to select the next set (e.g., line) of back side transfer modulesand these selected transfer modules are set to an even higher height asthe raised height value is further increased by the incremental heightvalue. This looping and repeated raising of further sets of back sidetransfer modules continues until there are no more back side transfermodules to process, at which point decision 690 branches to the “no”branch exiting process 670.

After the front side transfer modules have been lowered to their initialvalues and the back side transfer modules have been raised to theirinitial values, as described above, an inclined plane will have beencreated upon which the object moves in the horizontal direction selectedby the operator. Processing then returns to the calling routine (seeFIG. 5) at 695.

FIG. 7 is a flowchart showing steps performed while moving an objectusing the transfer ball grid. Processing commences at 700 whereupon, atstep 710, the incremental height that is used for the desired speed isretrieved. In one embodiment, the incremental height is selected by theoperator when determining a horizontal speed at which the object is totravel, while in another embodiment, the incremental height is a fixed,predetermined, height so that the objects travel at roughly the samespeeds across the surface. At step 720, the first set (e.g., lines) oftransfer modules are selected starting from the back side of the objectwith the front side of the object being towards the direction that theobject is moving across the surface.

At predefined process 730, the process sends a signal to the selectedtransfer modules to increase the current height by the incrementalheight value (see FIG. 9 and corresponding text for “INCREASE”processing details). A decision is made as to whether there are moretransfer modules currently underneath the object that is being moved(decision 740). If there are more transfer modules underneath theobject, then decision 740 branches to the “yes” branch which loops backto select and increment the next set (e.g., line) of transfer moduleswith the next set being the next set towards the front of the objectwhen compared to the previously selected set of transfer modules. Thislooping continues until there are no more transfer modules underneaththe object, at which point decision 740 branches to the “no” branch forfurther movement processing.

At step 750, the transfer modules that are currently located proximate(e.g., adjacent to) the object and in front of the object are selected(e.g., the transfer modules over which the object will travel next inits selected movement direction). At predefined process 760, thetransfer modules selected at step 750 are signaled to prepare to receivethe object by raising to a lowest usable level of the inclined plane(see FIG. 9 and corresponding text for “prepare to receive” processingdetails). As the object moves in the desired horizontal direction,transfer modules at the back of the object which will have been raisedto the highest level of the inclined plane, will eventually no longer beunderneath the object as the object fully passes over these transfermodules. At step 770, these transfer modules, now located behind theobject and no longer underneath the object, are selected. At predefinedprocess 780, the transfer modules selected at step 770 are signaled tofully retract to a disengaged position (see FIG. 9 and correspondingtext for “fully retract” processing details). Processing then returns tothe calling routine (see FIG. 5) at 795.

FIG. 8 is a flowchart showing steps performed during a controlled stopof the object being moved using the transfer ball grid. Controlledstoppage processing commences at 800 whereupon, at step 810, anincrement height is retrieved for a desired, or predefined, stoppagespeed. Greater increment heights create a quicker stopping time, whilelesser incremental heights create slower stopping time.

At step 815, the number of sets (e.g., lines, etc.) of transfer modulesunderneath the unit are identified from front to back with the frontbeing the direction of the horizontal movement. At step 820, themidpoint set is determined by dividing the total number of sets oftransfer modules by two. Two parallel processes commence (825 and 850)with process 825 operating to raise the front side transfer modules fromtheir current heights and process 850 operating to lower the back sideunits from their current heights.

Process 825 raises the front side transfer modules from the midpoint tothe front of the object. At step 830, the first set (e.g., line) oftransfer modules are selected nearest the midpoint. At predefinedprocess 835, processing signals each of the selected transfer modules toraise their height by the incremental height value (see FIG. 9 andcorresponding text for “INCREASE” processing details). A decision ismade as to whether there are more sets of front side transfer modules toraise (decision 840). If there are more front side transfer modules toraise (e.g., the front-most set of transfer modules has not beenreached), then decision 840 branches to the “yes” branch which loopsback to select the next set (e.g., line) of front side transfer modulesand these selected transfer modules are incrementally raised by theincremental height value. This looping and repeated raising of furthersets of front side transfer modules continues until there are no morefront side transfer modules to process, at which point decision 840branches to the “no” branch exiting process 825.

Process 850 lowers the back side transfer modules from the midpoint tothe back of the object. At step 855, the first set (e.g., line) oftransfer modules are selected nearest the midpoint. At predefinedprocess 860, processing signals each of the selected transfer modules tolower their height by the incremental height value (see FIG. 9 andcorresponding text for “DECREASE” processing details). A decision ismade as to whether there are more sets of back side transfer modules tolower (decision 865). If there are more back side transfer modules tolower (e.g., the back-most set of transfer modules has not beenreached), then decision 865 branches to the “yes” branch which loopsback to select the next set (e.g., line) of back side transfer modulesand these selected transfer modules are incrementally lowered by theincremental height value. This looping and repeated lowering of furthersets of back side transfer modules continues until there are no moreback side transfer modules to process, at which point decision 865branches to the “no” branch exiting process 850.

After processes 825 and 850 have executed to raise front side transfermodules and lower back side transfer modules as discussed above, at step870, the height is calculated as being the last selected (front-most)front side transfer module height. At step 875, the process selectstransfer modules in the direction of the objects horizontal movement asthe object is likely still moving. At predefined process 880, thetransfer modules selected at step 875 are signaled to raise their levelto the height value shown in step 870 (see FIG. 9 and corresponding textfor processing details used to raise transfer modules to a particularheight).

A decision is made as to whether the object has stopped moving (decision885). If the object has not stopped moving, then decision 885 branchesto the “no” branch which loops back to further raise the front sidetransfer modules and further lower the back side transfer modules asdescribed above. This looping continues until the object has stoppedmoving, at which point decision 885 branches to the “no” branch. Atpredefined process 890, all of the transfer modules underneath andproximate (e.g., adjacent to) the object are signaled to fully retractwhich lowers the object to the surface (see FIG. 9 and correspondingtext for “fully retract” processing details). Processing then returns tothe calling routine (see FIG. 5) at 895.

FIG. 9 is a flowchart showing processing performed at each transfer ballunit to process commands received at the unit. In one embodiment, eachtransfer module includes a processor to control operation of theparticular transfer module as directed by the main controller (see FIG.5 for main control operations). Processing commences at 900 whereupon,at step 910, transfer module grid configuration settings are retrievedfrom grid settings memory area 920. At step 925, the transfer modulewaits for the next request to arrive at the module (e.g., a signalreceived from one of the processes shown in FIGS. 5-8, etc.). A decisionis made as to whether a request has been received (decision 930).Decision 930 branches to the “no” branch and continues looping back tostep 925 until a request is received. When a request is received, thendecision 930 branches to the “yes” branch whereupon, at step 935, theprocess retrieves the transfer module's current height from memory area940.

A decision is made based on the type of request received by the transfermodule (decision 950, such as a select-case instruction). If an“initiate” request is received, then decision 950 branches to the“initiate” branch whereupon, at step 960, the transfer module raises itslevel to a uniform set for all of the transfer modules underneath theobject. If a “prepare to receive” request is received, then decision 950branches to the “prepare to receive” branch whereupon, at step 965, thetransfer module raises its level to a lowest usable level which is thelowest height of the incline plane used to move the object (e.g., a halfinch, etc.). If a numeric height value (e.g., 5 inches, etc.) request isreceived, then decision 950 branches to the “numeric height value”branch whereupon, at step 970, the transfer module raises its level theheight indicated in the request (e.g., 5 inches, etc.). If an “INCREASE”or “DECREASE” request is received, then decision 950 branches to the“INCREASE or DECREASE” branch whereupon, at step 975, the transfermodule raises or lowers its current height by the increase or decreaseamount. Finally, if a “fully retract” request is received, then decision950 branches to the “fully retract” branch whereupon, at step 980, thetransfer module is fully lowered to a disengaged position (e.g., levelwith or below the surface, etc.).

At step 990, the current height of the transfer module is saved inmemory area 940 based on the processing of the request. Processing thenloops back to step 925 to wait to receive the next request from acontrol module (see, e.g., FIGS. 5-8, etc.).

FIG. 10 is a flowchart showing processing used to perform aone-dimensional sort on a group of objects using the transfer ball grid.Using the surface of vertically-adjustable low friction transfer modulescontrolled by the processors as shown in the preceding drawings, groupsof objects can be arranged, such as in a sorted order. Objects that areout-of-order can be moved and arranged in a sorted order. Aone-dimensional sort of objects, such objects in a single lineformation, is shown in FIG. 10. Processing commences at 1000 whereupon,at step 1005, the process receives a request to sort a group of objectsthat resides on the surface into a sorted single line formation. At step1010, the process identifies the number of objects in the row to sort.In one embodiment, the number of objects are identified using thesensors, previously described, included in the floor surface. At step1015, the process identifies the available “empty” space on the floorsurface that is proximate to the line of objects that is being sorted. Adecision is made as to whether there is enough empty space on the floorfor each object to have its own row (decision 1020). If there is notenough empty space on the floor for each object to have its own row,then decision 1020 branches to the “no” branch whereupon, at predefinedprocess 1025, a process is performed to sort the line of objects using aminimal amount of space (see FIG. 13 and corresponding text forprocessing details) and processing ends at 1030. On the other hand, ifthere is enough empty space on the floor surface for each object to haveits own row, then decision 1020 branches to the “yes” branch for furtherprocessing.

At step 1035, the process performs a virtual sort of the objects in therow by an object sort value into a desired order. The desired order ofthe objects is stored in memory area 1040. For example, objects beingshipped may have a postal code associated with each of the objects beingshipped with the user desiring to have the objects sorted in postal codeorder so that they can be loaded onto a truck for shipment in an ordersimilar to how the objects will be delivered to their respectivedestinations. At step 1045, the first object in the row is selected (thefirst column of the row). At step 1050, the desired order of theselected object is retrieved from memory area 1040 and the desired orderis stored in the variable OBJ_POSITION. At step 1055, the new row forthe selected object (NEW_ROW) is set to the OBJ_POSITION. Using theexample shown in FIGS. 11 and 12, if the first object selected issupposed to be the fourth object in the row, then the object is moved tothe fourth row. At predefined process 1060, the transfer ball controlroutine is used to move the object at the selected row and column(row=1, column=1) to the new row (e.g., row 4, and the same column,e.g., column 1—see FIG. 5 and corresponding text for processing detailsregarding the transfer ball control routine). A decision is made as towhether there are more objects in the row to move (decision 1065). Ifthere are more objects in the row to move, then decision 1065 branchesto the “yes” branch which loops back to select the next object in therow (e.g., object 2 which is in column 2 of row 1) and the process movesthe newly selected object to the row corresponding to the newly selectedobjects sort position. Using the example from FIGS. 11 and 12, thesecond object has a sort position of five, so the second object would bemoved to the fifth row, second column. This looping continues until allof the objects have been selected and moved into their unique rowassignments as shown in Step 2 of FIG. 11. Note that the process loopsto the next object and commences appropriate movement without regard asto whether the previous object's move has been completed since all ofthe objects can be moving simultaneously across the floor surface. Onceall of the objects have been moved to their correct row, then decision1065 branches to the “no” branch to start moving the objects to theircorrect column position. At step 1070, the first object is selected(e.g., object D shown in FIG. 11, Step 2). At predefined process 1075,the selected object is moved to the column corresponding to its sortposition. As shown in FIG. 12, Step 3, Object D is moved to the fourthcolumn position. A decision is made as to whether there are additionalobjects to select and move (decision 1078). If there are additionalobjects to select and move, then decision 1078 branches to the “yes”branch which loops back to select and move the next object. This loopingcontinues until all of the objects have been selected and moved to theappropriate columns, such as shown in the example provided in FIG. 2,Step 3. When all of the objects have been selected and moved to theappropriate columns, then decision 1078 branches to the “no” branch forfurther processing. Note again that since each object was previouslymoved to its own row, the objects can be moved simultaneously as nocollisions will occur. Next, the objects are moved from their temporaryrows back to a common row where they will now be in sorted order. Atstep 1080, the first object is selected and, at predefined process 1085,the selected object is moved to the first (common) row. A decision ismade as to whether there are additional objects to move to the commonrow (decision 1090). If there are additional objects to move to thecommon row, then decision 1090 branches to the “yes” branch which loopsback to select and move the next object to the common row. This loopingcontinues until all of the objects are on the common row (e.g., row one)and are now in sorted order. FIG. 12, Step 4 shows an example of objectsbeing moved to the common row. Again, since each of the objects is inits own column, the objects can be moved simultaneously to the commonrow using the transfer ball grid and no collisions will occur.Processing then ends at 1095.

FIG. 11 is a first diagram showing the group of objects being sorted ina one-dimensional sort in an unconstrained grid environment. A flowchartshowing the logic used to move the objects as shown in FIGS. 11 and 12was previously presented in FIG. 10. Step 1 (1110) shows the initialarrangement of the objects on the surface of vertically-adjustable lowfriction transfer modules controlled by one or more processors. Asshown, the objects are out of order and are currently in D-E-B-A-C orderwhere the desired order is A-B-C-D-E. Step 2 (1020) shows the objectsbeing moved to their own row based on the object's relative sortposition. Here, Object A is not moved as it already resides in the firstrow, Object B is moved to the second row, Object C is moved to the thirdrow, Object D is moved to the fourth row, and Object E is moved to thefifth row.

FIG. 12 is a second diagram showing the group of objects being sorted ina one-dimensional sort in an unconstrained grid environment. Step 3(1130) shows Object A being moved to the first column, Object B beingmoved to the second column, Object C being moved to the third column,Object D being moved to the fourth column, and Object E being moved tothe fifth column. In the final step, Step 4 (1140), the objects aremoved back to a common row where they now appear in sorted order. ObjectA is already in the first row so it is not moved, Object B is moved downone row from row two to row one, Object C is moved down two rows fromrow three to row one, Object D is moved down three rows from row four torow one, and Object E is moved down four rows from row five to row one.

FIG. 13 is a flowchart showing processing used to perform aone-dimensional sort on a group of objects using the transfer ball gridin a constrained grid environment. Processing commences at 1300whereupon, at step 1305, variables are initialized with Length being setto the number of objects that are being sorted, Swaps being set to FALSEto indicate that no swaps have taken place, and Start column being setto one. An example of a row of objects that is being sorted using aminimal amount of space is shown in FIG. 15, element 1500. In theembodiment shown, a minimal amount of space used to swap objects is arow of empty space that is adjacent to the row of objects being sorted.In the process shown in steps 1310 through 1395, adjacent objects arerepeatedly compared to one another based on the sort position desiredfor the objects. If the objects are out of order, the objects areswapped by moving the object with the lower sort position object to theright of the object with the higher sort position. Elements 1500 through1580 provide examples of the swaps that occur to order the objects inthe correct sort positions.

Returning to FIG. 13, at step 1310 a first variable (i) is set to thestart column and, at step 1315, a second variable (j) is set to theadjacent column (i+1). A decision is made as to whether the objectsresiding at the columns (i and j) are in an incorrect order (decision1320). If the first object (the object residing at column (i)) has asort position value that is greater than the adjacent object (e.g., theobject to the first object's right side), then the objects need to beswapped in order to be in the correct order. If the objects need to beswapped, then decision 1320 branches to the “yes” branch whereupon, atpredefined process 1325 the two objects are physically swapped on thesurface using the vertically-adjustable low friction transfer modulesthat are controlled by the processors (see FIG. 14 and correspondingtext for processing details regarding the swapping of objects). Inaddition, at step 1330, the Swaps flag is set to TRUE to indicate thatobjects in the row have been swapped. On the other hand, if the twoobjects do not need to be swapped because the object on the left islower than or equal to the object to its right, then decision 1320branches to the “no” branch bypassing predefined process 1325 and step1330.

At step 1335, the position of the first object used in the comparison isincremented by two. If the start position was one, then the incrementedfirst position is three, then five, then seven, and so on. In oneembodiment, the start position oscillates between the first position andthe second position so that the objects being compared change on aregular basis. When the start position is two, then the incrementedfirst position is four, then six, then eight, and so on. A decision ismade as to whether the incremented first position is at or past the lastobject in the row that is being sorted (decision 1340). If theincremented first position is not yet at or past the last object in therow that is being sorted, then decision 1340 branches to the “no” branchwhereupon processing loops back to compare the sort position of the nextpair of objects and swap the objects if needed as described above. Thislooping continues until the incremented first position is at or past thelast object in the row that is being sorted, at which point decision1340 branches to the “yes” branch.

A decision is made as to whether the Swaps flag is still set to FALSEindicating that none of the objects needed to be swapped and that therow is now in the correct (sorted) order (decision 1345). If the Swapsflag is not FALSE, indicating that one or more pairs of objects wereswapped, then decision 1345 branches to the “no” branch to continue thesorting process. At step 1350, the Swaps flag is reset to FALSE toinitialize the next run. A decision is made as to whether the Startcolumn used to select pairs of objects is currently set to column one(decision 1355). If the Start column is currently set to column one,then decision 1355 branches to the “yes” branch whereupon, at step 1360,the Start column is set to column two. Conversely, if the Start columnis not currently set to column one (is instead set to column two), thendecision 1355 branches to the “no” branch whereupon, at step 1365 theStart column is set to column one. In this manner, when the Start columnis set to column one, objects in the first and second columns arecompared and swapped if needed, then objects in the third and fourthcolumns are compared and swapped if needed, and so on. Likewise, whenthe Start column is set to column two, objects in the second and thirdcolumns are compared and swapped if needed, then objects in the thirdand fourth columns are compared and swapped if needed, and so on. Atstep 1370, the process waits for the physical movement of objects beingswapped on the surface to complete before looping back to perform thenext iteration of comparisons and potential swaps. Note that during aniteration, multiple pairs of objects can be in the process of beingswapped with such objects moving simultaneously as a pair of objectsbeing swapped will not collide with objects positioned to the left orright of the pair.

Returning to decision 1345, if the objects in the row are processedwithout any swaps being performed (Swaps flag still set to FALSE), thenthe objects are in the correct sorted order and decision 1345 branchesto the “yes” branch whereupon processing ends at 1395.

FIG. 14 is a flowchart showing processing used to swap two objects usingthe transfer ball grid. The swap objects routine is provided parametersidentifying the two objects (i and j) to be swapped. Processingcommences at 1400 whereupon, at predefined process 1410, one of theobjects (e.g., object(j)) is moved to an adjacent empty position, suchas UP or DOWN when swapping objects arranged horizontally (see FIG. 5and corresponding text for processing details of the Transfer BallControl routine). At step 1420, the process waits for the objectmovement to complete. Once the object has been moved to the adjacentempty spot, then the object on the right (object(j) having been moved UPor DOWN to an adjacent empty row) is moved LEFT (predefined process1430) and the object on the left (object(i)) is moved RIGHT (predefinedprocess 1440). At step 1450, the process waits for movement of the twoobjects complete. At predefined process 1460, the object that wasinitially moved to the adjacent empty space (e.g., object(j)) is movedback to the same row as the object with which it was compared andswapped (e.g., object(i)). In the example shown, object(j) is moved DOWNone position to be adjacent to object(i). At step 1470, the processwaits until the movement of object(j) to the position adjacent toobject(i) at which point the routine returns to the calling routine(see, e.g., FIG. 13) at 1495.

FIG. 15 is a diagram showing the group of objects being sorted in aone-dimensional sort in a constrained grid environment, where there arejust two rows available to perform the sort

Arrangement 1500 shows the initial arrangement of unsorted objects onthe surface. The start column is indicated as being the first column.The first pair of objects (columns one and two) are in correct order andneed not be swapped. The second pair of objects (columns three and four)are not in correct order and need to be swapped. The third pair ofobjects (columns five and six) are in correct order and need not beswapped, and the last pair of objects (columns seven and eight) are notin correct order and need to be swapped. Swapping details are shown in1510 for swapping the pairs that need to be swapped (the second andfourth pairs). From initial arrangement 1500, the rightmost objects inthe pairs that were identified for swaps are moved to adjacent emptyspots on the transfer grid surface as shown in arrangement 1515.Arrangement 1520 shows the rightmost objects of the pairs being movedone position to the left and the leftmost objects being moved oneposition to the right. Arrangement 1525 shows the result of the swapwith the second and fourth pairs of objects now being arranged in thecorrect sorted order respective of the other object in the pair.

Arrangement 1525 is then analyzed but with the starting column now beingthe second column so that the first pair of objects reside in the secondand third columns, the second pair in the fourth and fifth columns, andso on. Here, all of the pairs (first, second, and third pair) areidentified as needing the respective paired objects swapped, the resultof which is shown in arrangement 1530. Arrangement 1530 is then analyzedwith the starting column now being the first column so that the firstpair of objects reside in the first and second columns and so on. Here,again, all pairs of objects are identified as needing to be swapped withthe result shown in arrangement 1540. Arrangement 1540 is analyzed withthe starting column being the second column and the analysis identifyingthe second and third pairs as needing swaps resulting in arrangement1550. Arrangement 1550 is analyzed with the starting column being thefirst column and the analysis identifying the second and third pairs asneeding swaps resulting in arrangement 1560. Arrangement 1560 isanalyzed with the starting column being the second column and theanalysis identifying all pairs (first, second and third pairs) asneeding swaps resulting in arrangement 1570. Arrangement 1570 isanalyzed with the starting column being the first column and theanalysis identifying the second and fourth pairs as needing swapsresulting in arrangement 1580. When arrangement 1580 is analyzed, noswaps are identified resulting in the sorted position of each object inthe horizontal arrangement being achieved.

The one-dimensional sorting and arrangement of objects as shown in FIGS.10-15 is one example of how physical objects can be sorted on thesurface of vertically-adjustable low friction transfer modulescontrolled by the processors as shown and described herein. Those ofskill in the art will appreciate that many different methodologies canbe employed to sort and arrange objects in a linear fashion with themethodology often being selected based on the environment andapplication, such as the size and number of objects routinely beingsorted and arranged.

FIG. 16 is a flowchart showing processing used to perform atwo-dimensional sort on a group of objects using the transfer ball grid.Processing commences at 1600 whereupon, at step 1610, the processreceives a request to sort a grid, or matrix, of objects into the samematrix pattern. In the example shown and described in FIGS. 16-22, afour-by-four matrix of objects, such as might be loaded on a palette andloaded onto a truck or train. Other applications using substantiallylarger matrices of objects can utilize the techniques shown in FIGS.16-22 as well as the linear sorting techniques shown and described inFIGS. 10-15 to manage larger matrices of objects. In addition, at step1610, empty space adjacent to the unsorted matrix is allocated. In oneembodiment, four times the column grid space (empty space) is allocatedto sort the four-by-four matrix and two times the row grid space (emptyspace) is also allocated to sort the matrix. At predefined process 1620,the objects in the matrix are physically spread out across the allocatedsurface area (see FIG. 17 and corresponding text for processingdetails). In addition, an example is shown in FIG. 21 with arrangement2110 showing the objects spread out across the available surface area.

At step 1630, the current object matrix (memory area 1625) is virtuallysorted by a sort value (e.g., postal code, etc.) into a sorted matrix ofrows and columns which is stored in memory area 1635. At predefinedprocess 1640, the objects, having been spread out across the availablesurface area, are moved to their proper rows according to the sortedmatrix stored in memory area 1635 (see FIG. 18 and corresponding textfor processing details, in addition see FIG. 21, arrangement 2120showing the objects having been moved into their proper rows). Atpredefined process 1650, the objects are grouped together to prepare forsorting (see FIG. 19 and corresponding text for processing details, inaddition see FIG. 22, arrangement 2200 showing the objects groupedtogether in their correct rows). The objects now reside on every otherrow so that empty adjacent space is available to sort the objects withineach of the rows. The current Row is set to the second row (with thefirst row being empty). At predefined process 1670, a one-dimensionalsort is performed on the selected Row (row two, see FIG. 13 andcorresponding text for processing details). The current Row isincremented by two to account for the empty row at step 1675. A decisionis made as to whether the current Row is still in the matrix of objectsbeing sorted (decision 1680). If the current Row is in the matrix ofobjects being sorted, then decision 1680 branches to the “yes” branchwhich loops back to perform a one dimensional sort of the current Row(e.g., Row four, etc.) using predefined process 1670 and incrementingthe current Row by two. This looping continues until the incremented Rowis no longer in the matrix that is being sorted. The result of thesorting of the various rows can be seen in FIG. 22, arrangement 2210.When all of the rows have been sorted, then decision 1680 branches tothe “no” branch whereupon, at predefined process 1690, the rows arepacked into the same space that where the unsorted matrix was found (seeFIG. 20 and corresponding text for processing details, also see FIG. 22,arrangement 2220 for the resulting packed rows). Processing then ends at1695.

FIG. 17 is a flowchart showing processing used to spread objects apartin order to perform the two-dimensional sort. Processing commences at1700 whereupon, at step 1710, the Row is initialized to the last(highest) row of the original matrix and the Column is initialized tothe last (highest) column of the original matrix. Starting with theoutermost objects allows these objects to be moved first without causingany collisions with other objects. When interior objects in the matrixare moved, their adjacent objects to the outside will have alreadystarted moving across the surface, avoiding collisions with the innerobjects of the original matrix. At step 1720, the new row (NEW_ROW) forthe selected object (initialized to be the object at the last column andat the last row) is set to be the Row multiplied by two (e.g., 4×2=8).At step 1730, the new column (NEW_COL) for the selected object is set tothe object's current column multiplied by four (e.g., 4×4=16). Atpredefined process 1740, the selected object is moved to the identifiednew row and column (e.g., row 8, column 16). See FIG. 5 andcorresponding text for transfer ball control processing details. At step1750, the current Row is decremented by one. A decision is made as towhether the current row is equal to zero and therefore outside thematrix (decision 1760). If the current row is not yet equal to zero,then processing loops back to step 1720 to select and move the nextobject from the original matrix. This looping continues until the rownumber is decremented to zero, at which point decision 1760 branches tothe “yes” branch. At step 1770, the current Column is decremented byone. A decision is made as to whether the current Column is equal tozero and therefore outside the matrix (decision 1780). If the currentColumn is not yet equal to zero, then processing loops back to step 1720to select and move the next object from the original matrix. Thislooping continues until the Column number is decremented to zero, atwhich point decision 1780 branches to the “yes” branch and processingreturns to the calling routine (see FIG. 16) at 1795.

FIG. 18 is a flowchart showing processing used to move objects tocorrect rows in the two-dimensional sort. Processing commences at 1800whereupon, at step 1810, the current Row is initialized to two sinceobjects have been moved to every other row starting with row two. Atstep 1820, the current column is initialized to half of the Row (e.g.,row two divided by two results in column one, etc.). At step 1830, theprocess selects the object currently residing at the current Row andColumn (e.g., Row two, Column one, etc.). At step 1840, the proper rowfor the selected object is retrieved from sorted object matrix memoryarea 1635. At predefined process 1850, the selected object is moved fromits current row to its proper row as identified at step 1840 whilestaying in the same column. At step 1860, the current Column isincremented by four since objects reside at every fourth column within arow. A decision is made as to whether the current Column is within theparameters of the surface area being used to store the objects (decision1870). If the current Column is being used to store objects, thendecision 1870 branches to the “yes” branch which loops back to retrievethe proper row for object residing at the current Row and current Columnand move the object to the proper row as described above. This loopingcontinues until the current Column is incremented outside the bounds setfor storing objects from the matrix, at which point decision 1870branches to the “no” branch.

At step 1880, the current Row is incremented by two since objects resideat every other row. A decision is made as to whether the incrementedcurrent Row is outside the bounds of rows used to store objects from thematrix (decision 1890). If the current (incremented) Row is being usedto store objects from the matrix of objects, then decision 1890 branchesto the “yes” branch which loops back to step 1820 which initializes thecurrent Column to half of the current Row (e.g., if the current Row asincremented is four, then the current column is initialized to two,etc.). The objects currently residing on the currently selected Row arethen moved, as described above, to their respective proper Rowsaccording to the sorted object matrix stored in memory area 1635. Thislooping continues until the current Row is incremented outside thebounds set for storing objects from the matrix, at which point decision1890 branches to the “no” branch and processing returns to the callingroutine (see FIG. 16) at 1895.

FIG. 19 is a flowchart showing processing used to group objects in thetwo-dimensional sort. Processing commences at 1900 whereupon, at step1910, the Row is initialized to two since the objects reside on everyother row starting with row two. At step 1920, the column is initializedto one. The new column (NEW_COL) where the next object that is foundwill be moved is initialized to one at step 1925. A decision is made asto whether an object currently resides at the selected Row and Column(decision 1940). If an object is at the selected Row and Column, thenthe object is moved horizontally to the new column (NEW_COL) atpredefined process 1950 and, at step 1960, the new column is incrementedby one. On the other hand, if an object does not currently reside at theselected Row and Column, then decision 1940 branches to the “no” branchbypassing predefined process 1950 and step 1960.

At step 1970, the selected Column is incremented by one. A decision ismade as to whether the selected Column is in the object matrix (decision1975). If the column is in the matrix, then decision 1975 branches tothe “no” branch which loops back to check if an object resides at theselected Row and Column and moves the object accordingly to the NewColumn (NEW_COL) position. This looping continues until the selectedcolumn is not in the matrix, at which point decision 1975 branches tothe “yes” branch. At step 1980, the selected Row is incremented by twosince objects reside, at this point, on every other row. A decision ismade as to whether the selected Row is in the object matrix (decision1990). If the selected Row is in the matrix, then decision 1990 branchesto the “no” branch which loops back to initialize the selected column toone (step 1920), check if an object resides at the selected Row andColumn, and moves the object accordingly to the New Column (NEW_COL)position. This looping continues until the selected row is not in thematrix, at which point decision 1990 branches to the “yes” branchwhereupon processing returns to the calling routine (see FIG. 16) at1995.

FIG. 20 is a flowchart showing processing used to pack rows of objectsin the two-dimensional sort. Processing commences at 2000 whereupon, atstep 2010 the new row (NEW_ROW) is initialized to one. At step 2020, theselected Row is initialized to two. At step 2030, the entire row ofobjects residing at the selected Row is selected and, at predefinedprocess 2040, each of the objects in the selected Row is moved to thenew row (NEW_ROW).

At step 2050, the new row (NEW_ROW) is incremented by one and, at step2060, the selected Row is incremented by two since the objects reside onevery other row. A decision is made as to whether the row, asincremented, is outside the bounds of rows used to store the matrix(decision 2070). If the selected Row is not outside the bounds of rowsused to store the matrix, then decision 2070 branches to the “no” branchwhich loops back to select and move the row as described above. Thislooping and moving of rows continues until the selected Row is outsidethe bounds of rows used to store the matrix, at which point decision2070 branches to the “yes” branch whereupon processing returns to thecalling routine (see FIG. 16) at 2095.

FIG. 21 is a first diagram showing the group of objects being spread outand then moved to correct rows. Arrangement 2100 shows the initialarrangement of unsorted objects in a grid, or matrix, pattern.Processing shown in FIG. 17 is used to spread the objects fromarrangement 2100 to arrangement 2110. Processing shown in FIG. 18 isused to move the objects from their respective positions in arrangement2110 to their proper rows as shown in arrangement 2120.

FIG. 22 is a second diagram showing the group of objects being groupedand packed to complete the two-dimensional sort. Processing shown inFIG. 19 is used to group objects from arrangement 2120 shown in FIG. 21to arrangement 2200 shown in FIG. 22. The grouped objects shown inarrangement 2200 are sorted using the linear sorting routine shown inFIG. 13, resulting in the sorted objects as they appear in arrangement2210. Finally, the processing shown in FIG. 20 is used to pack theobjects from arrangement 2210 to the packed and sorted arrangement shownin 2220.

One of the preferred implementations of the invention is a clientapplication, namely, a set of instructions (program code) or otherfunctional descriptive material in a code module that may, for example,be resident in the random access memory of the computer. Until requiredby the computer, the set of instructions may be stored in anothercomputer memory, for example, in a hard disk drive, or in a removablememory such as an optical disk (for eventual use in a CD ROM) or floppydisk (for eventual use in a floppy disk drive). Thus, the presentinvention may be implemented as a computer program product for use in acomputer. In addition, although the various methods described areconveniently implemented in a general purpose computer selectivelyactivated or reconfigured by software, one of ordinary skill in the artwould also recognize that such methods may be carried out in hardware,in firmware, or in more specialized apparatus constructed to perform therequired method steps. Functional descriptive material is informationthat imparts functionality to a machine. Functional descriptive materialincludes, but is not limited to, computer programs, instructions, rules,facts, definitions of computable functions, objects, and datastructures.

While particular embodiments of the present invention have been shownand described, it will be obvious to those skilled in the art that,based upon the teachings herein, that changes and modifications may bemade without departing from this invention and its broader aspects.Therefore, the appended claims are to encompass within their scope allsuch changes and modifications as are within the true spirit and scopeof this invention. Furthermore, it is to be understood that theinvention is solely defined by the appended claims. It will beunderstood by those with skill in the art that if a specific number ofan introduced claim element is intended, such intent will be explicitlyrecited in the claim, and in the absence of such recitation no suchlimitation is present. For non-limiting example, as an aid tounderstanding, the following appended claims contain usage of theintroductory phrases “at least one” and “one or more” to introduce claimelements. However, the use of such phrases should not be construed toimply that the introduction of a claim element by the indefinitearticles “a” or “an” limits any particular claim containing suchintroduced claim element to inventions containing only one such element,even when the same claim includes the introductory phrases “one or more”or “at least one” and indefinite articles such as “a” or “an”; the sameholds true for the use in the claims of definite articles.

What is claimed is:
 1. An information handling system comprising: one ormore processors; a memory coupled to at least one of the processors; aplurality of vertically-adjustable low friction transfer modules,controlled by at least one of the processors, wherein the plurality ofvertically-adjustable low friction transfer modules are arranged in agrid formation on a surface across which a plurality of objects aremoved; and a set of instructions stored in the memory and executed by atleast one of the processors to sort the objects across the surface usingthe vertically-adjustable low friction transfer modules, wherein the setof instructions perform actions of: receiving a request to sort theplurality of objects in a horizontal direction, wherein each of theplurality of objects is assigned a sort position; selecting a pluralityof sets of vertically-adjustable low friction transfer modules from theplurality of vertically-adjustable low friction transfer modules thatare arranged in a grid formation on the surface, wherein each of thesets of transfer modules are underneath a different one of the pluralityof objects; and vertically adjusting the plurality of sets of transfermodules causing each of the plurality of objects to move independentlyfrom the other objects while avoiding the other objects in two or moredimensions formed on the surface so that each of the plurality ofobjects is moved to a position respective of the other objects accordingto each objects' respective sort position.
 2. The information handlingsystem of claim 1 wherein each of the objects are initially positionedin a line formation on the surface, and wherein the plurality of objectsare moved to different positions in the line formation according to eachobjects' respective sort position.
 3. The information handling system ofclaim 2 wherein a sufficient area of the surface proximate to theinitial line formation exists so that each object can be placed on a rownot shared with another of the objects, and wherein the set ofinstructions perform further actions comprising: moving one or more ofthe objects so that each object occupies a unique row on the surface;moving one or more of the objects so that each object occupies a uniquecolumn on the surface, wherein each object's column corresponds to theobject's respective sort position; and moving one or more of the objectsto a common row so that the plurality of objects are in the lineformation according the each object's respective sort position.
 4. Theinformation handling system of claim 2 wherein the set of instructionsperform further actions comprising: selecting a first set of one or moreobjects and a second set of one or more objects, wherein the first setof objects is adjacent to the second set of one or more objects;identifying a first sort position corresponding to the first set of oneor more objects and a second sort position corresponding to the secondset of one or more objects; comparing the first sort position and thesecond sort position; swapping the first set of one or more objects withthe second set of one or more objects in response to the first sortposition being greater than the second sort position, wherein theswapping includes moving the first set of objects after the second setof objects on the surface; repeatedly performing the selecting, theidentifying, the comparing and the swapping until each object is in theline formation according to each object's respective sort position. 5.The information handling system of claim 1 wherein each of the objectsare initially positioned in a two-dimensional grid formation on thesurface, and wherein the plurality of objects are moved to differentpositions in the two-dimensional grid formation according to eachobjects' respective sort position.
 6. The information handling system ofclaim 5 wherein a sufficient area of the surface proximate to theinitial two-dimensional grid formation exists so that each object can beplaced on a column not shared with another of the objects, and whereinthe set of instructions perform further actions comprising: moving oneor more of the objects so that each object occupies a unique column onthe surface; identifying a desired row corresponding to each objectbased upon the object's respective sort position; moving one or more ofthe objects so that each object is at the object's identified desiredrow; and swapping one or more of the objects within each of the rows sothat each of the objects is at the object's respective sort position. 7.The information handling system of claim 5 wherein the set ofinstructions perform further actions comprising: swapping one or more ofthe objects so that each of the objects is at a row based on theobject's respective sort position; and swapping one or more of theobjects so that each of the objects is at a column based on the object'srespective sort position.
 8. A computer program product stored in acomputer readable medium, comprising computer instructions that, whenexecuted by an information handling system, causes the informationhandling system to perform actions comprising: receiving a request tosort a plurality of objects in a horizontal direction, wherein theplurality of objects rest on a surface of a plurality ofvertically-adjustable low friction transfer modules, wherein theplurality of vertically-adjustable low friction transfer modules arearranged in a grid formation on the surface across which the pluralityof objects are moved, and wherein each of the plurality of objects isassigned a sort position; selecting a plurality of sets ofvertically-adjustable low friction transfer modules from the pluralityof vertically-adjustable low friction transfer modules that are arrangedin a grid formation on the surface, wherein each of the sets of transfermodules are underneath a different one of the plurality of objects; andvertically adjusting the plurality of sets of transfer modules causingeach of the plurality of objects to move independently from the otherobjects while avoiding the other objects in two or more dimensionsformed on the surface so that each of the plurality of objects is movedto a position respective of the other objects according to each objects'respective sort position.
 9. The computer program product of claim 8wherein each of the objects are initially positioned in a line formationon the surface, and wherein the plurality of objects are moved todifferent positions in the line formation according to each objects'respective sort position.
 10. The computer program product of claim 9wherein a sufficient area of the surface proximate to the initial lineformation exists so that each object can be placed on a row not sharedwith another of the objects, and wherein the actions performed furthercomprise: moving one or more of the objects so that each object occupiesa unique row on the surface; moving one or more of the objects so thateach object occupies a unique column on the surface, wherein eachobject's column corresponds to the object's respective sort position;and moving one or more of the objects to a common row so that theplurality of objects are in the line formation according the eachobject's respective sort position.
 11. The computer program product ofclaim 9 wherein the actions performed further comprise: selecting afirst set of one or more objects and a second set of one or moreobjects, wherein the first set of objects is adjacent to the second setof one or more objects; identifying a first sort position correspondingto the first set of one or more objects and a second sort positioncorresponding to the second set of one or more objects; comparing thefirst sort position and the second sort position; swapping the first setof one or more objects with the second set of one or more objects inresponse to the first sort position being greater than the second sortposition, wherein the swapping includes moving the first set of objectsafter the second set of objects on the surface; repeatedly performingthe selecting, the identifying, the comparing and the swapping untileach object is in the line formation according to each object'srespective sort position.
 12. The computer program product of claim 8wherein each of the objects are initially positioned in atwo-dimensional grid formation on the surface, and wherein the pluralityof objects are moved to different positions in the two-dimensional gridformation according to each objects' respective sort position.
 13. Thecomputer program product of claim 12 wherein the actions performedfurther comprise: swapping one or more of the objects so that each ofthe objects is at a row corresponding to the object's respective sortposition; and swapping one or more of the objects so that each of theobjects is at a column corresponding to the object's respective sortposition.